def age (n):
    if n==1:
        return 8
    else:
        return age(n-1)+1
print(age(5))

k=3
for i in range(1,6):
    k=k+2
print(k)

a=1
b=1

for i in range(1,21):
    if i==1 or (i==2):
        print(1)
    else:    
        c=a+b
        print(c)
        a=b
        b=c
        
def qui (a):
    b=a[0]
    lo=[x for x in a[1:]if x<b]
    lo2=[x for x in a[1:]if x>=b]
    return lo,b,lo2
def quick (c):
    if len(c)<=1:
        return c
    lo,b,lo2=qui(c)
    return quick(lo)+[b]+quick(lo2)
lis=[4,2,5,6,8,3,1,7,9,9,2,2,9]
print(quick(lis))



def get_max(x=list):
    return max(x)
    
def solve(num=list):
    n=len(num)
    if n<=2:
        print(get_max(num))
        return get_max(num)
    left_lis,right_lis=num[:n//2],num[n//2:]
    left_max,right_max=solve(left_lis),solve(right_lis)
    return get_max([left_max,right_max] )
    
list1=[14,5,325,7,3463,74,2,67,4,3,74]
print(solve(list1))